A Clustering Framework Based Multipath Routing Protocol in Mobile Ad Hoc Networks

-The approach of using mobile sink has been adopted in ad hoc networks to achieve higher efficiency in terms of gathering data from sensors. Mobility-assisted data collection brings in new opportunities to improve the energy efficiency nodes. However, mobile sink also introduces new challenges such as routing the mobile network. A lot of research efforts have been devoted to reduce this latency. Cooperated with a routing algorithm, a concise and a clustering framework based multipath routing are proposed here. A given area can e divided into several zones with balanced routing latency. By modeling the routing problem as a Traveling Salesman Problem, an algorithm is designed to balance the data gathering latency among all the zones. Then mobile sinks are assigned to these zones separately. The data could be routing by these mobile sinks parallel thereupon. Extensive simulations are carried out evaluate our proposed scheme. Different distribution patterns are considered. Fictiveness of our proposed routing scheme is demonstrated through the simulation results.